A Constraint Programming Application for Rotating Workforce Scheduling

نویسندگان

  • Markus Triska
  • Nysret Musliu
چکیده

We describe CP-Rota, a new constraint programming application for rotating workforce scheduling that is currently being developed at our institute to solve real-life problems from industry. It is intended to complement FCS, a previously developed application. The advantages of CP-Rota over FCS are a significantly smaller and more maintainable code base, portability across a range of different language implementations and a more declarative approach that makes extensions easier and mistakes less likely. Our benchmarks show that CP-Rota is already competitive with FCS and even outperforms it on several hard real-life instances from the literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combination of Local Search Strategies for Rotating Workforce Scheduling Problem

Rotating workforce scheduling is a typical constraint satisfaction problem which appears in a broad range of work places (e.g. industrial plants). Solving this problem is of a high practical relevance. In this paper we propose the combination of tabu search with random walk and min conflicts strategy to solve this problem. Computational results for benchmark examples in literature and other rea...

متن کامل

Min Conflicts Based Heuristics for Rotating Workforce Scheduling Problem

Workforce scheduling problems are typical constraint satisfaction problems in which different constraints must be fulfilled, like needed workforce per day, forbidden sequences of shifts, length of work and days-off blocks etc. There are two main variants of workforce schedules: rotating (or cyclic) workforce schedules and non-cyclic workforce schedules. In a rotating workforce schedule all empl...

متن کامل

Solving a Workforce Management Problem with Constraint Programming

A workforce management problem in service industries is to determine how to allocate employees to jobs such that the service demand can be satis ed as much as possible at minimum cost. It has been studied in the Operations Research, Genetic Algorithms and other areas. Recently, Constraint Logic Programming (CLP) has provided a declarative and powerful tool which has been successfully used to so...

متن کامل

Title : Fast Local Search and Guided Local Search and Their Application to British Telecom ’ s Workforce Scheduling Problem

This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom’s workforce scheduling problem, which is a hard real ...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011